A computable convex programming characterization of optimal interpolatory quadratic splines with free knots

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On monotone and convex approximation by splines with free knots

We prove that the degree of shape preserving free knot spline approximation in L p a; b], 0 < p 1 is essentially the same as that of the non-constrained case. This is in sharp contrast to the well known phenomenon we have in shape preserving approximation by splines with equidistant knots and by polynomials. The results obtained are valid both for piecewise polynomials and for smooth splines wi...

متن کامل

Interpolation by Convex Quadratic Splines

Algorithms are presented for computing a quadratic spline interpolant with variable knots which preserves the monotonicity and convexity of the data. It is also shown that such a spline may not exist for fixed knots.

متن کامل

Convex Approximation by Quadratic Splines

Given a convex function f without any smoothness requirements on its derivatives, we estimate its error of approximation by C 1 convex quadratic splines in terms of ! 3 (f; 1=n).

متن کامل

On Characterization of Quadratic Splines

A quadratic spline is a differentiable piecewise quadratic function. Many problems in numerical analysis and optimization literature can be reformulated as unconstrained minimizations of quadratic splines. However, only special cases of quadratic splines are studied in the existing literature, and algorithms are developed on a case by case basis. There lacks an analytical representation of a ge...

متن کامل

Lifted Convex Quadratic Programming

Symmetry is the essential element of lifted inference that has recently demonstrated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether this holds for optimisation problems in general. Here we show that for a large class of optimisation methods this is actually the case. More precisely, we introdu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1986

ISSN: 0022-247X

DOI: 10.1016/0022-247x(86)90082-x